Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
نویسندگان
چکیده
منابع مشابه
Minimum Depth, Linear Size, and Fan-Out Two
We consider the problem of constructing fast and small binary adder circuits. Among widely-used adders, the Kogge-Stone adder is often considered the fastest, because it computes the carry bits for two n-bit numbers (where n is a power of two) with a depth of 2 log2 n logic gates, size 4n log2 n, and all fan-outs bounded by two. Fan-outs of more than two are avoided, because they lead to the in...
متن کاملLinear-Size Constant-Depth Polylog-Treshold Circuits
We present a simple explicit construction giving unbounded fan-in circuits with $o(n)$ gates and depth $O(r)$ for the threshold function of $n$ variables when the threshold is at most $(log n)^r$, for any integer $r>0$. This improves a result of Atjai and Ben-Or, who showed the existence of circuits of size $n^{O(1)}$. This is the highest threshold for which polynomial-size, constant-depth circ...
متن کاملQuantum Circuits with Unbounded Fan-out
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denoted by QNCf ) can approximate with polynomially small error the following gates: parity, mod[q], And, Or, majority, threshold[t], exact[q], and counting. Classically, we need logarithmic depth even if we can use unboun...
متن کاملDepth Reduction for Circuits of Unbounded Fan-In
We prove that constant depth circuits of size n log O(1) n over the basis AND, OR, PARITY are no more powerful than circuits of this size with depth four. Similar techniques are used to obtain several other depth reduction theorems; in particular, we show every set in AC 0 can be recognized by a family of depththree threshold circuits of size n log O(1) n . The size bound n log O(1) n is optima...
متن کاملDepth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
The depth hierarchy results for monotone circuits of Raz and McKenzie [5] are extended to the case of monotone circuits of semiunbounded fan-in. It follows that the inclusions NC ⊆ SAC ⊆ AC are proper in the monotone setting, for every i ≥ 1. Mathematics Subject Classification. 68Q17, 68Q15.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2018
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3147215